An Efficient Newton-Krylov Implementation of the Constrained Runs Scheme for Initializing on a Slow Manifold

نویسندگان

  • Christophe Vandekerckhove
  • Ioannis G. Kevrekidis
  • Dirk Roose
چکیده

The long-term dynamics of many dynamical systems evolves on a low-dimensional, attracting, invariant slow manifold, which can be parameterized by only a few variables (“observables”). The explicit derivation of such a slow manifold (and thus, the reduction of the long-term system dynamics) can be extremely difficult, or practically impossible. For this class of problems, the equation-free computational approach has been developed to perform numerical tasks with the unavailable reduced (coarse-grained) model based on short full model simulations. Each full model simulation should be initialized consistent with the values of the observables and close to the slow manifold. For this purpose, a class of constrained runs functional iterations was recently proposed. The schemes in this class only use the full model simulator and converge, under certain conditions, to an approximation of the desired state on the slow manifold. In this paper, we develop a constrained runs implementation that is based on a (preconditioned) Newton-Krylov method rather than on a functional iteration. We implement and compare both the functional iteration and Newton-Krylov method, using, as the full simulator, a lattice-Boltzmann model for a one-dimensional nonlinear reaction diffusion system. Depending on the parameters of the lattice Boltzmann model, the constrained runs functional iteration may converge slowly or even diverge. We show that both issues are largely resolved by using the constrained runs Newton-Krylov method, especially when a coarse grid correction preconditioner is incorporated.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Semi-Lagrangian Two-Level Preconditioned Newton-Krylov Solver for Constrained Diffeomorphic Image Registration

We propose an efficient numerical algorithm for the solution of diffeomorphic image registration problems. We use a variational formulation constrained by a partial differential equation (PDE), where the constraints are a scalar transport equation. We use a pseudospectral discretization in space and second-order accurate semi-Lagrangian time stepping scheme for the transport equations. We solve...

متن کامل

Stability and Stabilization of the Constrained Runs Schemes for Equation-free Projection to a Slow Manifold

In [C. W. Gear, T. J. Kaper, I. G. Kevrekidis and A. Zagaris, Projecting to a slow manifold: Singularly perturbed systems and legacy codes, SIAM J. Appl. Dyn. Syst. 4 (2005), 711–732], we developed the family of constrained runs algorithms to find points on low-dimensional, attracting, slow manifolds in systems of nonlinear differential equations with multiple time scales. For user-specified va...

متن کامل

Short Communication A Parallel Newton–Krylov Method for Navier–Stokes Rotorcraft Codes

The application of Krylov subspace iterative methods to unsteady three-dimensional Navier–Stokes codes on massively parallel and distributed computing environments is investigated. Previously, the Euler mode of the Navier–Stokes flow solver Transonic Unsteady Rotor Navier–Stokes (TURNS) has been coupled with a Newton–Krylov scheme which uses two Conjugate-Gradient-like (CG) iterative methods. F...

متن کامل

An Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation

In this paper, a new genetic algorithm (GA) is presented for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) with minimization of project makespan as the objective subject to resource and precedence constraints. A random key and the related mode list (ML) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (MSSG...

متن کامل

Superlinearly convergent exact penalty projected structured Hessian updating schemes for constrained nonlinear least squares: asymptotic analysis

We present a structured algorithm for solving constrained nonlinear least squares problems, and establish its local two-step Q-superlinear convergence. The approach is based on an adaptive structured scheme due to Mahdavi-Amiri and Bartels of the exact penalty method of Coleman and Conn for nonlinearly constrained optimization problems. The structured adaptation also makes use of the ideas of N...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Sci. Comput.

دوره 39  شماره 

صفحات  -

تاریخ انتشار 2009